A Determinacy Approach to Borel Combinatorics

نویسنده

  • ANDREW S. MARKS
چکیده

We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Borel Determinacy of Concurrent Games

Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown necessary. The determinacy proof proceeds via a reduction to the determinacy of tree games, and th...

متن کامل

Notes on Borel Determinacy

In this talk, we will provide a high level sketch of Martin’s proof of Borel Determinacy.

متن کامل

From winning strategy to Nash equilibrium

Game theory is usually considered applied mathematics, but a few game-theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e. the existence of a winning strategy in games that involve two players and two outcomes saying who wins. In a multi-outcome setting, the notion of winning strategy is ir...

متن کامل

Countable Dense Homogeneity of Definable Spaces

We investigate which definable separable metric spaces are countable dense homogeneous (CDH). We prove that a Borel CDH space is completely metrizable and give a complete list of zero-dimensional Borel CDH spaces. We also show that for a Borel X ⊆ 2 the following are equivalent: (1) X is Gδ in 2 ω , (2) X is CDH and (3) X is homeomorphic to 2 or to ω . Assuming the Axiom of Projective Determina...

متن کامل

What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead

We investigate determinacy of delay games with Borel winning conditions, infinite-duration twoplayer games in which one player may delay her moves to obtain a lookahead on her opponent’s moves. First, we prove determinacy of such games with respect to a fixed evolution of the lookahead. However, strategies in such games may depend on information about the evolution. Thus, we introduce different...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013